An Algorithmic Approach to Recover Inconsistent Knowledge-Bases

نویسنده

  • Ofer Arieli
چکیده

We consider an algorithmic approach for revising inconsistent data and restoring its consistency. This approach detects the \spoiled" part of the data (i.e., the set of assertions that cause inconsistency), deletes it from the knowledge-base, and then draws classical conclusions from the \recovered" information. The essence of this approach is its coherence with the original (possibly inconsistent) data: On one hand it is possible to draw classical conclusions from any data that is not related to the contradictory information, while on the other hand, the only inferences allowed by this approach are those that do not contradict any former conclusion. This method may therefore be used by systems that restore consistent information and are obliged to their resource of information. Common examples of this case are diagnostic procedures that analyse faulty components of malfunction devices, and database management systems that amalgamate distributed knowledge-bases. 1 Motivation In this paper we introduce an algorithmic approach to revise inconsistent information and restore its consistency. This approach (sometimes called \coherent" 5], or \conservative" 15]) considers contradictory data as useless, and uses only a consistent part of the original information for making inferences. To see the rationality behind this approach consider, for instance, the following set of pro-positional assertions: Since :p is true in KB, so is :p_q (even if q is false), and so a plausible inference mechanism should not apply here the Disjunctive Syllogism to p and :p_q. Intuitively, this is so since the information regarding p is contradictory, and so one should not rely on it for drawing inferences. On the other hand, applying the Disjunctive Syllogism to fr; :r_sg may be justiied by the fact that this subset of formulae should not be aaected by the inconsistency in KB, therefore inference rules that are classically valid can be applied to it. The two major goals of coherent approaches in general, and our formalism in particular, are therefore the following:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bilattice-based Approach to Recover Consistent Data from Inconsistent Knowledge-Bases

Bilaitices, which have been shown to be very useful in logic programming, are used here for recovering consistent data from an inconsistent knowledge-base. Our method is coaseroative in the sense that it considers the contradictory data as useless, and regards all the remaining information unaffected. This kind of approach is nonmonotonic and paraconsistent in nature.

متن کامل

Managing Inconsistent Possibilistic Knowledge Bases by An Argumentation Approach

Inconsistent knowledge bases usually are regarded as an epistemic hell that have to be avoided at all costs. However, many times it is di cult or impossible to stay away of managing inconsistent knowledge bases. In this paper, we introduce an argumentation-based approach in order to manage inconsistent possibilistic knowledge bases. This approach will be exible enough for managing inconsistent ...

متن کامل

A Four-valued Approach for Handling Inconsistency in Prioritized Knowledge-bases

The use of priorities among formulae is an important tool to appropriately revise inconsistent knowledge-bases. We present a four-valued semantical approach for recovering consistent data from prioritized knowledge-bases. This approach is nonmonotonic and paraconsistent in nature.

متن کامل

An Algorithm for Knowledge Base Extraction

Many approaches have been proposed for reasoning based on conflicting information in general and in particular on stratified knowledge bases, i.e. bases in which all pieces of information are assigned a rank. In this paper, we want to reflect on a particular family of algorithmic approaches known as Adjustments, which have been suggested for extracting a consistent knowledge base from a possibl...

متن کامل

Adjusting adjustments - an algorithm for knowledge base extraction

Many approaches have been proposed for reasoning based on conflicting information in general and in particular on stratified knowledge bases, i.e. bases in which all pieces of information are assigned a rank. In this paper, we want to reflect on a particular family of algorithmic approaches known as Adjustments, which have been suggested for extracting a consistent knowledge base from a possibl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000